#include "BinaryTree.h"
#include "stack.h"
void Bubble()
{
    int a[] = {1,2,3,4,5,6,7,8,9,-1};
    int n = sizeof(a)/sizeof(int);
    BubbleSort(a,n);
    PrintArray(a,n);
}
void Heap()
{
    int a[] = {1,2,3,4,5,6,7,8};
    int n = sizeof(a)/sizeof(int);
    HeapSort(a,n);
    PrintArray(a,n);
}
void Insert()
{
    int a[] = {8,7,6,5,4,3,2,1,11,22,33,22};
    int n = sizeof(a)/sizeof(int);
    InsertSort(a,n);
    PrintArray(a,n);
}
void Quick()
{
    int a[] = {8,7,6,5,4,3,2,1,11,22,33,22};
    int n = sizeof(a)/sizeof(int);
    QuickSort1(a,0,n-1);
    PrintArray(a,n);
}
void QuickNotR()
{
    int a[] = {8,7,6,5,4,3,2,1,11,22,33,22};
    int n = sizeof(a)/sizeof(int);
    QuickSortNotR(a,0,n-1);
    PrintArray(a,n);
}
void Merge()
{
    int a[] = {8,7,6,5,4,3,2,1,11,22,33,22};
    int n = sizeof(a)/sizeof(int);
    MergeSort(a,n);
    PrintArray(a,n);
}
void MergeNotR()
{
    int a[] = {11,22,33,10,6,7,1,3,9,4,2};
    int n = sizeof(a)/sizeof(int);
    MergeSortNotR(a,n);
    PrintArray(a,n);
}
void Count()
{
    int a[] = {2222,100,11,22,33,10,6,7,1,3,9,4,2};
    int n = sizeof(a)/sizeof(int);
    CountSort(a,n);
    PrintArray(a,n);
}
int main()
{
//    Bubble();
//    Heap();
//    Insert();
//    Quick();
//    QuickNotR();
    MergeNotR();
    Count();
    Merge();
    return 0;
}